Abstract Interpretation Frameworks
نویسندگان
چکیده
Interpretation Frameworks Patrick Cousot LIENS, École Normale Supérieure 45, rue d’Ulm 75230 Paris cedex 05 (France) [email protected] Radhia Cousot LIX, École Polytechnique 91128 Palaiseau cedex (France) [email protected]
منابع مشابه
Sequence-based abstract interpretation of Prolog
Abstract interpretation is a general methodology for systematic development of program analyses. An abstract interpretation framework is centered around a parametrized nonstandard semantics that can be instantiated by various domains to approximate different program properties. Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to extract information ...
متن کاملOn the Computational Complexity of Naive-Based Semantics for Abstract Dialectical Frameworks
Abstract dialectical frameworks (ADFs) are a powerful generalization of Dung’s abstract argumentation frameworks. ADFs allow to model argumentation scenarios such that ADF semantics then provide interpretations of the scenarios. Among the considerable number of ADF semantics, the naivebased ones are built upon the fundamental concept of conflict-freeness. Intuitively, a three-valued interpretat...
متن کاملAn Introduction to Abstract Interpretation
Predicate Transformer (Sketchy) ̧P ‹ post[[X:=E]] ‹ ‚P(fq1; : : : ; qng) where fq1; : : : ; qng „ fp1; : : : ; pkg = ̧P ‹ post[[X:=E]]( n \ i=1 I[[qi]]) def. ‚P = ̧P(f[X=[[E]]] j 2 n \ i=1 I[[qi]]g) def. post[[X:=E]] = ̧P( n \ i=1 f[X=[[E]]] j 2 I[[qi]]g) def. \ = ̧P( n \ i=1 I[[qi[X=E]]]) def. substitution = fpj j I[[qi[X=E]) pj]]g def. ̧P ) fpj j theorem_prover[[qi[X=E]) pj]]g since th...
متن کاملType and Eeect Systems via Abstract Interpretation
Abstract interpretation and type and e ect systems are two well known frameworks for the static analysis of programs While abstract interpretation uses the program control ow to approximate its run time behavior type and e ect systems are based on the pro gram structural syntax The fundamental result of this paper is to show how these a priori distinct approaches can be related to each other sh...
متن کاملAnalyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
Abstract dialectical frameworks (ADFs) have recently been proposed as a versatile generalization of Dung’s abstract argumentation frameworks (AFs). In this paper, we present a comprehensive analysis of the computational complexity of ADFs. Our results show that while ADFs are one level up in the polynomial hierarchy compared to AFs, there is a useful subclass of ADFs which is as complex as AFs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 2 شماره
صفحات -
تاریخ انتشار 1992